Перевод: со всех языков на все языки

со всех языков на все языки

unconstrained case

См. также в других словарях:

  • Ellipsoid method — The ellipsoid method is an algorithm for solving convex optimization problems. It was introduced by Naum Z. Shor, Arkady Nemirovsky, and David B. Yudin in 1972, and used by Leonid Khachiyan to prove the polynomial time solvability of linear… …   Wikipedia

  • Subgradient method — Subgradient methods are algorithms for solving convex optimization problems. Originally developed by Naum Z. Shor and others in the 1960s and 1970s, subgradient methods can be used with a non differentiable objective function. When the objective… …   Wikipedia

  • voluntary — Unconstrained by interference; unimpelled by another s influence; spontaneous; acting of oneself. Coker v. State, 199 Ga. 20, 33 S.E.2d 171, 174. Done by design or intention. Proceeding from the free and unrestrained will of the person. Produced… …   Black's law dictionary

  • Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

  • Lagrange multiplier — Figure 1: Find x and y to maximize f(x,y) subject to a constraint (shown in red) g(x,y) = c …   Wikipedia

  • Principle of minimum energy — The principle of minimum energy is essentially a restatement of the second law of thermodynamics. It states that for a closed system, with constant external parameters and entropy, the internal energy will decrease and approach a minimum value at …   Wikipedia

  • Kant: Critique of Judgement — Patrick Gardiner Kant’s third Critique, the Critique of Judgement, was published in 1790 and was intended as he himself put it to bring his “entire critical undertaking to a close.” So conceived, it was certainly in part designed to build upon… …   History of philosophy

  • Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • dance — dancingly, adv. /dans, dahns/, v., danced, dancing, n. v.i. 1. to move one s feet or body, or both, rhythmically in a pattern of steps, esp. to the accompaniment of music. 2. to leap, skip, etc., as from excitement or emotion; move nimbly or… …   Universalium

  • optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of …   Universalium

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»